The Convergence Rate of Godunov Type Schemes
نویسندگان
چکیده
منابع مشابه
The Convergence Rate of Godunov Type Schemes
Godunov type schemes form a special class of transport projection methods for the approximate solution of nonlinear hyperbolic conservation laws. We study the convergence rate of such schemes in the context of scalar conservation laws. We show how the question of consistency for Godunov type schemes can be answered solely in terms of the behavior of the associated projection operator. Namely, w...
متن کاملGas Evolution Dynamics in Godunov-Type Schemes
As a continuous eeort to understand the Godunov-type schemes, following the paper \Projection in this paper we are going to study the gas evolution dynamics of the exact and approximate Riemann solvers. More speciically, the underlying dynamics of Flux Vector Splitting (FVS) and Flux Diierence Splitting (FDS) schemes will be analyzed. Since the FVS scheme and the Kinetic Flux Vector Splitting (...
متن کاملOn the Rate of Convergence of Kirk-Type Iterative Schemes
The purpose of this paper is to introduce Kirk-type new iterative schemes called Kirk-SP and Kirk-CR schemes and to study the convergence of these iterative schemes by employing certain quasi-contractive operators. By taking an example, we will compare Kirk-SP, Kirk-CR, Kirk-Mann, Kirk-Ishikawa, and Kirk-Noor iterative schemes for aforementioned class of operators. Also, using computer programs...
متن کاملConvergence of Godunov-Type Schemes for Scalar Conservation Laws under Large Time Steps
In this paper, we consider convergence of classical high order Godunov-type schemes towards entropy solutions for scalar conservation laws. It is well known that sufficient conditions for such convergence include total variation boundedness of the reconstruction and cell or wavewise entropy inequalities. We prove that under large time steps, we only need total variation boundedness of the recon...
متن کاملOn Rate of Convergence of Jungck-Type Iterative Schemes
and Applied Analysis 3 Szn − p = (1 − γn) Sxn + γnTxn − (1 − γn + γn) p ≤ (1 − γ n ) Sxn − p + γn Txn − Tz ≤ (1 − γ n ) Sxn − p + γ n {φ (‖Sz − Tz‖) + a Sxn − Sz } = (1 − γ n (1 − a)) Sxn − p . (13) It follows from (13) that Syn − p ≤ (1 − βn) a Sxn − p + β n a (1 − γ n (1 − a)) Sxn − p . (14) Using (1 − β ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Numerical Analysis
سال: 1994
ISSN: 0036-1429,1095-7170
DOI: 10.1137/0731001